Planarizing Graphs - A Survey and Annotated Bibliography

Algorithms for Drawing Graphs: an Annotated Bibliography

Several data presentation problems involve drawing graphs so that they are easy to read and understand. Examples include circuit schematics and software engineering diagrams. In this paper we present a bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs. Research on this topic is spread over the broad spectrum of Computer Science. This bibliogra...

Survey topic: Parallel Clustering Algorithms Annotated Bibliography of the literature found

** This thesis studies graph clustering on bipartite and chordal graphs. It describes two types of clustering problems: a partition of the vertex of a graph with minimum diameters of subgraphs; maximizing possible number of edges given fixed number of vertices.

Planarization of Graphs Embedded on Surfaces

A planarizing set of a graph is a set of edges or vertices whose removal leaves a planar graph. It is shown that, if G is an n-vertex graph of maximum degree d and orientable genus g, then there exists a planarizing set of O(p dgn) edges. This result is tight within a constant factor. Similar results are obtained for planarizing vertex sets and for graphs embedded on nonorientable surfaces. Pla...

An Annotated Bibliography for Post - solutionAnalysis in Mixed Integer Programming andCombinatorial

This annotated bibliography focuses on what has been published since the 1977 Geoorion-Nauss survey, and it is in BibT E X format, so it can be searched on the World Wide Web. In addition to postoptimal sensitivity analysis, this survey includes debugging a run, such as when the integer program is unbounded, anomalous or infeasible.

Computing by Graph Transformation a Survey and Annotated Bibliography Edited By